#include <stdio.h>

#define maxn 200005
int n, m;
int heads[maxn], heights[maxn];

void swap(int A[], int a, int b) {
  int t = A[a];
  A[a] = A[b];
  A[b] = t;
}

void quicksort(int A[], int n) {
  if(n<=1) return;
  int pivotIndex = 0;
  int pivot = A[0];
  int l=0, r=n;
  while(l<r) {
    while(l<r && pivot<A[--r]);
    while(l<r && A[++l]<pivot);
    swap(A, l, r);
  }
  swap(A, pivotIndex, l);
  quicksort(A, l);
  quicksort(A+l+1, n-l-1);
}

int main() {
  while(scanf("%d%d", &n, &m)==2) {
    if(n==0 && m==0) break;
    for(int i=0; i<n; ++i) scanf("%d", heads+i);
    for(int i=0; i<m; ++i) scanf("%d", heights+i);
    quicksort(heads, n);
    quicksort(heights, m);
    int ans = 0;
    int i=0, j=0;
    while(i<n && j<m) {
#if 0
      while(heads[i]>heights[j] && j<m) j++;
      if(j==m) break;
      ans += heights[j];
      i++, j++;
#else
      if(heads[i]<=heights[j]) {
        ans += heights[j];
        i++, j++;
      }
      else {
        j++; // Next please
      }
#endif
    }
    if(i==n) {
      printf("%d\n", ans);
    }
    else {
      printf("Loowater is doomed!\n");
    }
  }
}
